Optimal trajectories for efficient atomic transport without final excitation
نویسندگان
چکیده
منابع مشابه
Efficient Algorithms for Globally Optimal Trajectories
We present serial and parallel algorithms for solving a system of equations that arises from the discretization of the Hamilton-Jacobi equation associated to a trajectory optimization problem of the following type. A vehicle starts at a prespecified point zo and follows a unit speed trajectory ~ ( t ) inside a region in P. until an unspecified time T that the region is exited. A trajectory mini...
متن کاملBiomechanical Investigation of Empirical Optimal Trajectories Introduced for Snatch Weightlifting
The optimal barbell trajectory for snatch weightlifting has been achieved empirically by several researchers. They have studied the differences between the elite weightlifters’ movement patterns and suggested three optimal barbell trajectories (type A, B, and C). But they didn’t agree for introducing the best trajectory. One of the reasons is this idea that the selected criterion by researchers...
متن کاملRobot dynamic calibration: Optimal excitation trajectories and experimental parameter estimation
Advanced robot control schemes require an accurate knowledge of the dynamic parameters of the manipulator. This article examines various issues related to robot dynamic calibration, from generation of optimal excitation trajectories to data acquisition and filtering, and experimental inertial and friction parameter estimation. In particular, a new method is developed for the determination of op...
متن کاملThrust - Limited Optimal Three - Dimensional Spacecraft Trajectories
Several optimal three-dimensional orbital transfer problems are solved for thrust-limited spacecrafts using collocation and nonlinear programming techniques. The solutions for full nonlinear equations of motion are obtained where the integrals of the free Keplerian motion in three dimensions are utilized for coasting arcs. In order to limit the solution space, interior-point constraints are use...
متن کاملImplementation of Efficient Algorithms for Globally Optimal Trajectories ∗
We consider a continuous-space shortest path problem in a two-dimensional plane. This is the problem of finding a trajectory that starts at a given point, ends at the boundary of a compact set of <2, and minimizes a cost function of the form ∫ T 0 r(x(t))dt+ q(x(T )). For a discretized version of this problem, a Dijkstra-like method that requires one iteration per discretization point has been ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2011
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.84.043415